Using Chaotic Maps to Construct Anonymous Multi-receiver Scheme Based on BAN Logic

Multi-receiver public key encryption is an essential cryptography paradigm, which enables flexible, on-demand, and low computing to transmit one message securely among the users by the to form over an insecure network. In this paper, we propose a novel Chaotic Maps-based Multi-Receiver scheme, named CMMR, aiming to require one ciphertext with non-interactive process for achieve authentication and the message transmission secretly. Compared with Multi-receiver Identity-Based Encryption (MRIBE), our proposed scheme mainly owns three merits: (1) One is to eliminate the private key generators (PKG) in one domain or multi-domain, in other words, our scheme will be highly decentralized and aim to capture distributed. Our goals are to minimize the hazards of single-point of security, single-point of efficiency and single-point of failure about the PKG. (2) The other is that our scheme is based on chaotic maps, which is a high efficient cryptosystem and is firstly used to construct multi-receiver public key encryption. (3) The last merit is the most important: Unlike bilinear pairs cryptosystem that need many redundant algorithms to get anonymity, while our scheme can acquire privacy protection easily. Next, a novel idea of our CMMR scheme is to adopt chaotic maps for mutual authentication and privacy protection, not to encrypt/decrypt messages transferred between the sender and the receivers, which can make our proposed scheme much more efficient. Finally, we give the formal security proof about our scheme in the standard model and efficiency comparison with recently related works.